On Hamilton cycles in cubic (m, n)-metacirculant graphs, II

نویسنده

  • Ngo Dac Tan
چکیده

continue to investigate the problem of the existence of a Hamilton connected cubic (m,n)-metacirculant graphs. We show that a connected cubic (m,n)-metacirculant graph G = MC(m, n, a, So, ,.., has Hamilton cycle if either a 2 == 1 (mod n) or in the case of an odd number f.L one of the numbers (a 1) or a + a 2 _ ... ajJ.-2 + ajJ.-l) relatively to n. As a corollary of results we obtain that every connected cubic ,-UJlet;aClJrCUl1arlt graph has a Hamilton cycle if m and n are integers odd prime divisor of m is not a divisor of where r.p the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Hamilton cycles in cubic (m, n)-metacirculant graphs

Connected cubic (m,n)-metacircu1ant graphs, other than the Petersen , have been to be hamiltonian for m m divisible by 4 and m = 2. In this paper we two sufficient conditions tor connected cubic-metac1rcu1ant with m even, than 2 and not divisible by 4 to be hamiltonian. As corQ1laries, we show that every connected cubic-metacircu1ant other than the Petersen ,has a Hamilton if anyone of the cond...

متن کامل

On the isomorphism problem for a family of cubic metacirculant graphs

In this paper an isomorphism testing algorithm for graphs in the family of all cubic metacirculant graphs with non-empty first symbol So is given. The time complexity of this algorithm is also evaluated.

متن کامل

Heuristic search for Hamilton cycles in cubic graphs

A successful heuristic algorithm for nding Hamilton cycles in cubic graphs is described Several graphs from The Foster census of connected symmetric trivalent graphs and all cubic Cayley graphs of the group PSL are shown to be hamiltonian Proposed running head HAMILTON CYCLES IN CUBIC GRAPHS

متن کامل

Hamilton Cycles in Cubic Graphs

A graph is cubic if each of its vertex is of degree 3 and it is hamiltonian if it contains a cycle passing through all its vertices. It is known that if a cubic graph is hamiltonian, then it has at least three Hamilton cycles. This paper is about those works done concerning the number of Hamilton cycles in cubic graphs and related problems.

متن کامل

Hamilton cycles containing randomly selected edges in random regular graphs

In previous papers the authors showed that almost all d-regular graphs for d ≥ 3 are hamiltonian. In the present paper this result is generalized so that a set of j oriented root edges have been randomly specified for the cycle to contain. The Hamilton cycle must be orientable to agree with all of the orientations on the j root edges. It is shown that the requisite Hamilton cycle almost surely ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 14  شماره 

صفحات  -

تاریخ انتشار 1996